Branch and bound

Results: 97



#Item
91Strengthening Landmark Heuristics via Hitting Sets Blai Bonet1 and Malte Helmert2 Abstract. The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heu

Strengthening Landmark Heuristics via Hitting Sets Blai Bonet1 and Malte Helmert2 Abstract. The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heu

Add to Reading List

Source URL: www2.informatik.uni-freiburg.de

Language: English - Date: 2010-05-29 10:18:47
92Computers & Operations Research[removed] – 504  www.elsevier.com/locate/dsw

Computers & Operations Research[removed] – 504 www.elsevier.com/locate/dsw

Add to Reading List

Source URL: www.fsa.ulaval.ca

Language: English - Date: 2003-02-03 07:58:48
93

PDF Document

Add to Reading List

Source URL: www.akira.ruc.dk

Language: English - Date: 2004-04-19 12:29:30
94

PDF Document

Add to Reading List

Source URL: www.gams.com

Language: English - Date: 2013-06-17 06:52:37
95

PDF Document

Add to Reading List

Source URL: webdiis.unizar.es

Language: English - Date: 2004-12-27 07:48:47
96

PDF Document

Add to Reading List

Source URL: tx.technion.ac.il

Language: English - Date: 2005-03-09 09:46:04
97

PDF Document

Add to Reading List

Source URL: library.utia.cas.cz

Language: English - Date: 2010-05-13 08:58:13